Restrained Disjunctive Domination in Graphs under Some Binary Operations
نویسندگان
چکیده
A set S ⊆ V (G) is a disjunctive dominating of graph G if for every v ∈ (G)\S, neighbor vertex in or has at least two vertices each distance 2 from v. We say that restrained (G)\S there exists u \ such uv E(G) exist distinct u, w dG(u, v) = dG(w, v). The minimum cardinality γdr(G) the domination number G. In this paper, we characterize sets some binary operations as join, corona and lexicographic product graphs and, result, obtain values their corresponding numbers.
منابع مشابه
restrained roman domination in graphs
a roman dominating function (rdf) on a graph g = (v,e) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. a set s v is a restrained dominating set if every vertex not in s is adjacent to a vertex in s and to a vertex in . we define a restrained roman dominating function on a graph g = (v,e) to be ...
متن کاملSome Algorithmic Results on Restrained Domination in Graphs
A set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained dominating set of minimum cardinality. Given a graph G, and a positive integer k, the RESTRAINED DOMINATION DECISION problem is to decide whether G has a restrained dominating ...
متن کاملRestrained domination in unicyclic graphs
Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the minimum cardinality of a restrained dominating set of G. A unicyclic graph is a connected graph that contains precisely one cycle. We show that if U is a unicyclic graph of order n, th...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملInverse and Disjoint Restrained Domination in Graphs
Let D be a minimum secure restrained dominating set of a graph G = (V, E). If V – D contains a restrained dominating set D' of G, then D' is called an inverse restrained dominating set with respect to D. The inverse restrained domination number γr(G) of G is the minimum cardinality of an inverse restrained dominating set of G. The disjoint restrained domination number γrγr(G) of G is the minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2022
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v15i1.4187